Search for: All records

Multilayer networks describe the rich ways in which nodes are related by accounting for different relationships in separate layers. These multiple relationships are naturally represented by an adjacency tensor. In this work we study the use of the nonnegative Tucker decomposition (NNTuck) of such tensors under a KL loss as an expressive factor model that naturally generalizes existing stochastic block models of multilayer networks. Quantifying interdependencies between layers can identify redundancies in the structure of a network, indicate relationships between disparate layers, and potentially inform survey instruments for collecting social network data. We propose definitions of layer independence, dependence, and redundancy based on likelihood ratio tests between nested nonnegative Tucker decompositions. Using both synthetic and real-world data, we evaluate the use and interpretation of the NNTuck as a model of multilayer networks. Algorithmically, we show that using expectation maximization (EM) to maximize the log-likelihood under the NNTuck is step-by-step equivalent to tensorial multiplicative updates for the NNTuck under a KL loss, extending a previously known equivalence from nonnegative matrices to nonnegative tensors. 

Abstract Cascades over networks (e.g., neuronal avalanches, social contagions, and system failures) often involve higher-order dependencies, yet theory development has largely focused on pairwise-interaction models. Here, we develop a ‘simplicial threshold model’ (STM) for cascades over simplicial complexes that encode dyadic, triadic and higher-order interactions. Focusing on small-world models containing both short- and long-range k -simplices, we explore spatio-temporal patterns that manifest as a frustration between local and nonlocal propagations. We show that higher-order interactions and nonlinear thresholding coordinate to robustly guide cascades along a k -dimensional generalization of paths that we call ‘geometrical channels’. We also find this coordination to enhance the diversity and efficiency of cascades over a simplicial-complex model for a neuronal network, or ‘neuronal complex’. We support these findings with bifurcation theory and data-driven approaches based on latent geometry. Our findings provide fruitful directions for uncovering the multiscale, multidimensional mechanisms that orchestrate the spatio-temporal patterns of nonlinear cascades. 

Despite the vast literature on network dynamics, we still lack basic insights into dynamics on higher-order structures (e.g., edges, triangles, and more generally, [Formula: see text]-dimensional “simplices”) and how they are influenced through higher-order interactions. A prime example lies in neuroscience where groups of neurons (not individual ones) may provide building blocks for neurocomputation. Here, we study consensus dynamics on edges in simplicial complexes using a type of Laplacian matrix called a Hodge Laplacian, which we generalize to allow higher- and lower-order interactions to have different strengths. Using techniques from algebraic topology, we study how collective dynamics converge to a low-dimensional subspace that corresponds to the homology space of the simplicial complex. We use the Hodge decomposition to show that higher- and lower-order interactions can be optimally balanced to maximally accelerate convergence and that this optimum coincides with a balancing of dynamics on the curl and gradient subspaces. We additionally explore the effects of network topology, finding that consensus over edges is accelerated when two-simplices are well dispersed, as opposed to clustered together.